Switche May Solve Adjacency Problems
نویسنده
چکیده
This paper presents a new method for defining grid-point adjacencies, called the switch approach. It is discussed how it relates to connectedness definition in multi-valued images. The paper illustrates how the method can be used, and provides a few experimental data illustrating the relevance and simplicity of the approach. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. [email protected] You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). Switches May Solve Adjacency Problems Reinhard Klette CITR, Department of Computer Science,Tamaki Campus The University of Auckland, Private Bag 92019, Auckland, New Zealand Email: [email protected]
منابع مشابه
NP-Completeness of Non-Adjacency Relations on Some 0-1 Polytopes
In this paper, we discuss the adjacency structures of some classes of 0-1 polytopes including knapsack polytopes, set covering polytopes and 0-1 polytopes represented by complete sets of implicants. We show that for each class of 0-1 polytope, non-adjacency test problems are NP-complete. For equality constrained knapsack polytopes, we can solve adjacency test problems in pseudo polynomial time.
متن کاملApplying an integrated fuzzy gray MCDM approach: A case study on mineral processing plant site selection
The accurate selection of a processing plant site can result in decreasing total mining cost. This problem can be solved by multi-criteria decision-making (MCDM) methods. This research introduces a new approach by integrating fuzzy AHP and gray MCDM methods to solve all decision-making problems. The approach is applied in the case of a copper mine area. The critical criteria are considered adja...
متن کاملSpectral Partitioning of Random Graphs
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all three problems above in the average case, as well as a more general problem of partitioning graph...
متن کاملA Simple Efficient Circuit Partitioning by Genetic Algorithm
Circuit partitioning problem is a well known NP hard problem. The potential of Genetic Algorithm has been used to solve many computationally intensive problems (NP hard problems) because existing conventional methods are unable to perform the required breakthrough in terms of complexity, time and cost. This paper deals with the problem of partitioning of a circuit using Genetic Algorithm. The a...
متن کاملVoronoi Diagrams and Spatial Adjacency
One of the basic concerns of Geographic Information Systems and their application is the spatial relationships between objects on the map. This has been attacked from two directions: by the construction/linking of polygon boundary segments; and by including spatial operators within data-base retrieval requests. In both cases only an incomplete picture has been obtained due to the lack of any co...
متن کامل